Practical unconditionally secure two-channel message authentication
نویسندگان
چکیده
منابع مشابه
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication protocols (NIMAPs) and interactive message authentication protocols (IMAPs). We provide a new proof of nonexistence of nontrivial unconditionally secure NIMAPs. This proof consists of a combinatorial counting argument ...
متن کاملPractical Unconditionally Secure Two-channel Message Authentication In Honour of Spyros Magliveras’ 70th Birthday
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel cryptography employs a broadband, insecure wireless channel and an authenticated, narrow-band manual channel at the same time.) We study both noninteractive message authentication protocols (NIMAPs) and interactive message authentication protocols (IMAPs) in ...
متن کاملPractical and Secure Message Authentication
Use of encryption algorithms in message authentication is replaced by secure hash functions which are often faster than encryption algorithms. Tsudik 14] has proposed three methods on message authentication which are only based on one-way hash functions and use some keys to make them secure. In this paper, we give a set of practical methods, each of which uses a fast collision free hash functio...
متن کاملComposable, Unconditionally Secure Message Authentication without any Secret Key
We consider a setup in which the channel from Alice to Bob is less noisy than the channel from Eve to Bob. We show that there exist encoding and decoding which accomplish error correction and authentication simultaneously; that is, Bob is able to correctly decode a message coming from Alice and reject a message coming from Eve with high probability. The system does not require any secret key sh...
متن کاملUnconditionally Secure Entity Authentication
This paper studies the entity-authentication problem in an information theoretic framework, where adversaries are innnitely powerful. We rst derive lower bounds on the cheating probability and the size of keys. Next, we show an unconditionally secure and optimum entity-authentication scheme that meets all our bounds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2010
ISSN: 0925-1022,1573-7586
DOI: 10.1007/s10623-009-9352-5